-
1 лексикографический минимум
Русско-английский словарь по электронике > лексикографический минимум
-
2 лексикографический минимум
Русско-английский словарь по радиоэлектронике > лексикографический минимум
-
3 лексикографический минимум
Русско-английский научно-технический словарь Масловского > лексикографический минимум
-
4 словарный
1. прил. к словарь 2; lexical научн.2. прил. к словарь 1; тж. lexicographic -
5 словарный
1) ( лексический) lexicalслова́рный запа́с — word stock, vocabulary
слова́рный соста́в языка́ — vocabulary [word stock] of a language
слова́рный ми́нимум — minimum vocabulary
2) ( относящийся к словарям) dictionary (attr); lexicographic
См. также в других словарях:
Lexicographic code — Lexicographic codes or lexicodes are greedily generated error correcting codes with remarkably good properties. They were produced independently byLevenshtein [V.I. Levenstein. A class of systematic codes. Soviet Math. Dokl, 1(1):368 371, 1960.]… … Wikipedia
Lexicographical order — In mathematics, the lexicographic or lexicographical order, (also known as lexical order, dictionary order, alphabetical order or lexicographic(al) product), is a generalization of the way the alphabetical order of words is based on the… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Price of anarchy — The price of anarchy is a concept from game theory that describes the difference in maximum social utility and the utility of an equilibrium point of the game.DefinitionGiven a game G=(N,A,u), it is natural to consider the social welfare , i.e.… … Wikipedia
Prim's algorithm — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
D* — This article is about a search algorithm. For the digital voice and data protocol specification, see D STAR. For the physical quantity, see Specific detectivity. Graph and tree search algorithms … Wikipedia
Cooperative game — This article is about a part of game theory. For video gaming, see Cooperative gameplay. For the similar feature in some board games, see cooperative board game In game theory, a cooperative game is a game where groups of players ( coalitions )… … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
B+ tree — In computer science, a B+ tree is a type of tree which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key . It is a dynamic, multilevel index, with maximum… … Wikipedia